Independent domination in regular graphs
نویسندگان
چکیده
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملMinus domination in regular graphs
A three-valued function f defined on the vertices of a graph G = (V,E), f : V , ( 1 , 0 , 1), is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every v E V, f(N[v])>~ 1, where N[v] consists of v and every vertex adjacent to v. The weight of a minus dominating function is f ( V ) = ~ f (v) , over all vertices v E V. The mi...
متن کاملOn the Independent Domination Number of Random Regular Graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either in v ∈ D or there exists a vertex u ∈ D that is adjacent to v. We are interested in finding dominating sets of small cardinality. A dominating set I of a graph G is said to be independent if no two vertices of I are connected by an edge of G. The size of a smallest independent dominating set of a g...
متن کاملConnected domination of regular graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the subgraph induced by the vertices of C in G is connected. A weakly-connected dominating set W of a g...
متن کاملIndependent transversal domination in graphs
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00022-b